On the Distribution of SINR for Widely Linear MMSE MIMO Systems With Rectilinear or Quasi-Rectilinear Signals
نویسندگان
چکیده
Although the widely linear least mean square error (WLMMSE) receiver has been an appealing option for multiple-input-multiple-output (MIMO) wireless systems, a statistical understanding on its pose-detection signal-to-interference-plus-noise ratio (SINR) in detail is still missing. To this end, we consider WLMMSE MIMO transmission system with rectilinear or quasi-rectilinear (QR) signals over uncorrelated Rayleigh fading channel and investigate properties of SINR arbitrary antenna configuration $N_t$ transmit antennas notation="LaTeX">$N_r$ receive ones. We first derive analytic probability density function (PDF) terms confluent hypergeometric second kind, systems notation="LaTeX">$N_t=2, 3$ . For more general case practice, i.e., notation="LaTeX">$N_t>3$ , resort to moment generating obtain approximate but closed form PDF under some mild conditions, which, as expected, Gaussian-like notation="LaTeX">$2N_r-N_t$ increases. The so-derived PDFs are able provide key insights into outage probability, symbol rate, diversity gain, all presented form. In particular, gain improvement conventional LMMSE one explicitly quantified notation="LaTeX">$N_r-(N_t-1)/2$ notation="LaTeX">$(N_t-1)/2$ respectively. Finally, Monte Carlo simulations support analysis.
منابع مشابه
How to Make Quasi-Rectilinear Signals (MSK, GMSK, OQAM) Almost Equivalent to Rectilinear Ones (BPSK, ASK) for Widely Linear Filtering in the Presence
Widely linear (WL) receivers are able to fulfill single antenna interference cancellation (SAIC) of one rectilinear (R) or quasi-rectilinear (QR) co-channel interference (CCI), a function which is operational in GSM handsets in particular. However, SAIC requires enhancements for QR signals, for both VAMOS standard, an evolution of GSM/EDGE standard, and FBMC-OQAM networks, which are candidate f...
متن کاملRectilinear Paths among Rectilinear Obstacles
Given a set of obstacles and two distinguished points in the plane the problem of nding a collision free path subject to a certain optimization function is a fundamental problem that arises in many elds, such as motion planning in robotics, wire routing in VLSI and logistics in operations research. In this survey we emphasize its applications to VLSI design and limit ourselves to the rectilinea...
متن کاملRectilinear Path Problems among Rectilinear Obstacles Revisited
We present eecient algorithms for nding rectilinear collision-free paths between two given points among a set of rectilinear obstacles. Our results improve the time complexity of previous results for nding the shortest rectilinear path, the minimum-bend shortest rectilinear path, the shortest minimum-bend rectilinear path and the minimum-cost rectilinear path. For nding the shortest rectilinear...
متن کاملRectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods
We consider a setting where we are given a graph G = (R, E), where R = {R1, . . . , Rn} is a set of polygonal regions in the plane. Placing a point pi inside each region Ri turns G into an edge-weighted graph Gp , p = {p1, . . . , pn}, where the cost of (Ri, Rj) ∈ E is the distance between pi and pj . The Shortest Path Problem with Neighborhoods asks, for given Rs and Rt, to find a placement p ...
متن کاملOn Rectilinear Link Distance
Given a simple polygon P without holes all of whose edges are axis-parallel, a rectilinear path in P is a path that consists of axis-parallel segments only and does not cross any edge of P. The length of such a path is defined as the number of segments it consists of and the rectilinear link distance between two points in P is defined as the length of the shortest path connecting the two points...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Vehicular Technology
سال: 2022
ISSN: ['0018-9545', '1939-9359']
DOI: https://doi.org/10.1109/tvt.2021.3132377